Representing the Process Algebra CSP in Type Theory
نویسندگان
چکیده
We introduce the library CSP-Agda which represents CSP processes in Agda. CSPAgda allows to prove in Agda properties of CSP processes. CSP processes are implemented coinductively (or coalgebraically). They are formed like inductive data types from atomic operations, but infinite loops, i.e. non-wellfounded processes, are allowed.
منابع مشابه
Higher Order Logic Mechanization of the CSP Failure-Divergence Semantics
concurrency, formal verification, higher orderlogic,process algebra, theorem prover Reasoning using process algebra often involves doing complex proofs and computer-based support to facilitate the task is therefore desirable. In this paper we show how a general purpose theorem prover based on higher order logic provides a natural framework for mechanizing the process algebra CSP. This is done b...
متن کاملCsp, Partial Automata, and Coalgebras | Draft |
Based on the theory of coalgebras the paper builds a bridge between CSP and au-tomata theory. We show that the concepts of processes in 4] coincide with the concepts of states for special, namely, nal partial automata. Moreover, we show how the deterministic and nondeterministic operations in 4] can be interpreted in a compatible way by constructions on the semantical level of automata. Especia...
متن کاملStructured CSP - A Process Algebra as an Institution
We introduce two institutions for the process algebra Csp, one for the traces model, and one for the stable failures model. The construction is generic and should be easily instantiated with further models. As a consequence, we can use structured specification constructs like renaming, hiding and parameterisation (that have been introduced over an arbitrary institution) also for Csp. With a sma...
متن کاملA THEORY OF ASY } ' iCHRONOUS PROCESSES
A theory of asynchronous processes (nondeterministic data florv net-rvorks) is presented. It consists of a mathematical model and a process algebra. The intention is to provide a better theoretical underpinning to the Jackson System Development metirod. The model is so constructed as to be compatible rvith the failures modei of Hoare's Communicating Sequential Processes. The process algebra des...
متن کاملChecking SysML Models for Co-simulation
Cyber-physical systems (CPSs) are often treated modularly to tackle both complexity and heterogeneity; and their validation may be done modularly by co-simulation: the coupling of the individual subsystem simulations. This modular approach underlies the FMI standard. This paper presents an approach to verify both healthiness and wellformedness of an architectural design, expressed using a profi...
متن کامل